Layout-oblivious compiler optimization for matrix computations
نویسندگان
چکیده
منابع مشابه
A Layout-oblivious Compiler Optimization for Matrix Computations
Most scientific computations serve to apply mathematical operations to a set of preconceived data structures, e.g., matrices, vectors, and grids. In this paper, we use a number of widely used matrix computations from the LINPACK library to demonstrate that complex internal organizations of data structures can severely degrade the effectiveness of compilers optimizations. We then present a data ...
متن کاملAn Optimization Layer for Distributed Matrix Computations
Distributed matrix computations are essential in many big data applications. Algorithms for problems such as Noisy Matrix Factorization have applications in many areas such as recommender systems (i.e. Netflix), succinct data storage, clustering, and more. For large matrices, these algorithms quickly become computationally expensive, and it is necessary to allocate computational resources (such...
متن کاملOptimal Cache-Oblivious Mesh Layout
This paper shows how to generate a cache-oblivious memory layout of a well-shaped finite-element mesh G. This cache-oblivious mesh layout enables asymptotically optimal mesh updates, in which each vertex communicates with all of its neighbors. Mesh updates is the building block of iterative linear system solver. For block size B and cache size M, the mesh update cost is O(1+ |G|/B), assuming th...
متن کاملOptimization by direct search in matrix computations
A direct search method attempts to maximize a function f l R using function values only. Many questions about the stability and accuracy of algorithms in matrix computations can be expressed in terms of the maximum value of some easily computable function f. For a variety of algorithms it is shown that direct search is capable of revealing instability or poor performance, even when such failure...
متن کاملGraph Layout for Applications in Compiler Construction
We address graph visualization from the viewpoint of com piler construction Most data structures in compilers are large dense graphs such as annotated control ow graph syntax trees dependency graphs Our main focus is the animation and interactive exploration of these graphs Fast layout heuristics and powerful browsing methods are needed We give a survey of layout heuristics for general directed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Architecture and Code Optimization
سال: 2013
ISSN: 1544-3566,1544-3973
DOI: 10.1145/2400682.2400694